On the relations between monadic semantics

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a monadic semantics for freshness

A standard monad of continuations, when constructed with domains in the world ofFM-sets [1], is shown to provide a model of dynamic allocation of fresh names that isboth simple and useful. In particular, it is used to prove that the powerful facilitiesfor manipulating fresh names and binding operations provided by the “FreshML”series of metalanguages [2–4] respect α-equivalence ...

متن کامل

Program Slicing Based on Monadic Semantics

Syntax: p :: = program ide is b b :: = d begin c end d :: = const ide = l.e | var ide : t | d1; d2 c :: = ide := l.e | c1; c2| skip | read ide | write l.e |while l.e do c endwhile | if l.e then c1 else c2 endif

متن کامل

A Modular Monadic Action Semantics

A domain-specific language (DSL) is a framework which is designed to precisely meet the needs of a particular application. Domain-specific languages exist for a variety of reasons. As productivity tools, they are used to make application prototyping and development faster and more robust in the presence of evolving requirements. Furthermore, by bridging the “semantic gap” between an application...

متن کامل

Dynamic Semantics as Monadic Computation

This paper proposes a formulation of the basic ideas of dynamic semantics in terms of the state monad. Such a monadic treatment allows to specify meanings as computations that clearly separate context updating and context accessing operations from purely truth conditional meaning composition. Different behavior regarding the availability of referents throughout a discourse is modelled by adding...

متن کامل

Computational semantics for monadic quantifiers

The paper gives a survey of known results related to computational devices (finite and push–down automata) recognizing monadic generalized quantifiers in finite models. Some of these results are simple reinterpretations of descriptive—feasible correspondence theorems from finite–model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2007

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2006.12.027